Unconditional Byzantine Agreement for any Number of Faulty Processors

نویسندگان

  • Birgit Pfitzmann
  • Michael Waidner
چکیده

We present the first Byzantine agreement protocol which tolerates any number of maliciously faulty processors without relying on computational assumptions (such as the unforgeability of digital signatures). Our protocol needs reliable broadcast and secret channels in a precomputation phase. For a security parameter σ, it achieves Byzantine agreement with an error probability of at most 2–σ, whereas all computations are polynomial in σ and the number of processors. The protocol is based on an unconditionally secure authentication mechanism, called pseudosignatures. Pseudosignatures are a generalization of a mechanism by CHAUM and ROIJAKKERS and might be useful in other protocols, too.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links

adi it ion ally, the problems of Byzantine agreement, concensus, and interactive consistency are studied in a fully connected network with processors in malicious failure only. Such problems are re-examined with the assumption of malicious faults on both processors and links. The proposed protocols use the minimum number of message exchanges and can tolerate the maximum number of allowable faul...

متن کامل

Unconditional Byzantine Agreement with Good Majority

We present a protocol which achieves Byzantine Agreement (BA) if less than half of the processors are faulty and which does not rely on unproved computational assumptions such as the unforgeability of digital signatures. This is the first protocol which achieves this level of security. Our protocol needs reliable broadcast and secret channels in a precomputation phase. For a security parameter ...

متن کامل

Cmsc 858k — Advanced Topics in Cryptography

In this lecture, we study the Byzantine Agreement problem, defined as follows: consider a network of n processors, where each pair of processors can communicate (this is the so-called “point-to-point” model). Furthermore, at most t processors within this network may be faulty; a faulty processor may exhibit arbitrary behavior. (We also assume that the behavior of these faulty processors may be ...

متن کامل

The new territory of mobile agreement

The fault-tolerance is an important research topic in the study of distributed systems. To cope with the influence from faulty processors, reaching a common agreement at the presence of faults before performing some special tasks is essential. Therefore, the Byzantine Agreement (BA) problem has drawn more and more of the researchers’ attention as they explore deeper and deeper into the world of...

متن کامل

Reaching Fault Diagnosis Agreement under a Hybrid Fault Model

ÐThe goal of the fault diagnosis agreement (FDA) problem is to make each fault-free processor detect/locate a common set of faulty processors. The problem is examined on processors with mixed fault model (also referred to as hybrid fault model). An evidence-based fault diagnosis protocol is proposed to solve the FDA problem. The proposed protocol first collects the messages which have accumulat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992